Minimum feedback vertex set and acyclic coloring
نویسندگان
چکیده
منابع مشابه
Minimum feedback vertex set and acyclic coloring
In the feedback vertex set problem, the aim is to minimize, in a connected graph G = (V ,E), the cardinality of the set V (G)⊆ V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in...
متن کامل9.2 Minimum Feedback Vertex Set
Roughly speaking, the local ratio method works iteratively, and in each iteration it breaks a suitable structure (the local structure) to solve from the residual structure in that iteration. Typically the local structure is an instance that is very easy to solve. The main claim that is required is that the solution to the local structure can be patched with the solution from the next iteration,...
متن کاملMinimum Weighted Feedback Vertex Set on Diamonds
Given a vertex weighted graph G, a minimum Weighted Feedback Vertex Set (MWFVS) is a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The MWFVS on general graph is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve MWFVS on it. We will discuss, moreove...
متن کاملComputing Minimum Directed Feedback Vertex Set in O(1.9977n)
In this paper we propose an algorithm which, given a directed graph G, finds the minimum directed feedback vertex set (FVS) of G in O∗(1.9977n) time and polynomial space. To the best of our knowledge, this is the first algorithm computing the minimum directed FVS faster than in O(2n). The algorithm is based on the branch-and-prune principle. The minimum directed FVS is obtained through computin...
متن کاملMinimum Feedback Vertex Set in k - Dimensional Hypercubes Riccardo
In this paper we nd upper and lower bounds to the size of the feedback vertex set for k-dimensional hypercubes. Given a graph, the minimum feedback vertex set problem consists of nding a subset of vertices of minimum size whose removal induces an acyclic subgraph. The problem is NP-hard for general networks 2], but interesting polynomial solutions have been found for particular
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2002
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00265-x